Hans Zantema : rechercher sur Z-Library

Le plus grand référentiel d'articles scientifiques au monde. 70,000,000+ d'articles gratuitement.

Don't use scam websites

Livres
Articles (28)
Les plus populaires
Liste
- Liste
- Tableau

1

Total Termination of Term Rewriting is Undecidable

Journal:

Journal of Symbolic Computation

Année:

1995

Fichier:

PDF, 537 KB

1995

2

Transforming equality logic to propositional logic

Hans Zantema, Jan Friso Groote

Journal:

Electronic Notes in Theoretical Computer Science

Année:

2003

Langue:

english

Fichier:

PDF, 660 KB

english, 2003

3

A Probabilistic Analysis of the Game of the Goose

Groote, Jan Friso, Wiedijk, Freek, Zantema, Hans

Journal:

Année:

2016

Langue:

english

Fichier:

PDF, 15.08 MB

english, 2016

4

A Transformational Approach to Prove Outermost Termination Automatically

Matthias Raffelsieper, Hans Zantema

Journal:

Electronic Notes in Theoretical Computer Science

Année:

2009

Langue:

english

Fichier:

PDF, 352 KB

english, 2009

5

Simple termination of rewrite systems

Aart Middeldorp, Hans Zantema

Journal:

Theoretical Computer Science

Année:

1997

Langue:

english

Fichier:

PDF, 2.25 MB

english, 1997

6

Termination modulo equations by abstract commutation with an application to iteration

Wan Fokkink, Hans Zantema

Journal:

Theoretical Computer Science

Année:

1997

Langue:

english

Fichier:

PDF, 1.01 MB

english, 1997

7

Simulating Liveness by Reduction Strategies

Jürgen Giesl, Hans Zantema

Journal:

Electronic Notes in Theoretical Computer Science

Année:

2003

Langue:

english

Fichier:

PDF, 215 KB

english, 2003

8

Adding constants to string rewriting

René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp

Journal:

Applicable Algebra in Engineering, Communication and Computing

Année:

2008

Langue:

english

Fichier:

PDF, 177 KB

english, 2008

9

A Complete Characterization of Termination of 0p 1q→ 1r 0s

Hans Zantema, Alfons Geser

Journal:

Applicable Algebra in Engineering, Communication and Computing

Année:

2000

Langue:

english

Fichier:

PDF, 166 KB

english, 2000

10

Matrix Interpretations for Proving Termination of Term Rewriting

Jörg Endrullis, Johannes Waldmann, Hans Zantema

Journal:

Journal of Automated Reasoning

Année:

2008

Langue:

english

Fichier:

PDF, 487 KB

english, 2008

11

The N-terminal transactivation domain of ATF2 is a target for the co-operative activation of the c-jun promoter by p300 and 12S E1A

Duyndam, Monique CA, van Dam, Hans, Smits, Paul HM, Verlaan, Matty, van der Eb, Alex J, Zantema, Alt

Journal:

Année:

1999

Langue:

english

Fichier:

PDF, 312 KB

english, 1999

12

Non-Looping String Rewriting

Geser, Alfons, Zantema, Hans

Journal:

RAIRO - Theoretical Informatics and Applications

Année:

1999

Langue:

english

Fichier:

PDF, 24 KB

english, 1999

13

Relative Undecidability in Term Rewriting: I. The Termination Hierarchy

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema

Journal:

Information and Computation

Année:

2002

Langue:

english

Fichier:

PDF, 243 KB

english, 2002

14

Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema

Journal:

Information and Computation

Année:

2002

Langue:

english

Fichier:

PDF, 142 KB

english, 2002

15

On tree automata that certify termination of left-linear term rewriting systems

Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema

Journal:

Information and Computation

Année:

2007

Langue:

english

Fichier:

PDF, 367 KB

english, 2007

16

Generalizing DPLL and satisfiability for equalities

Bahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema

Journal:

Information and Computation

Année:

2007

Langue:

english

Fichier:

PDF, 209 KB

english, 2007

17

Levels of undecidability in rewriting

Jörg Endrullis, Herman Geuvers, Jakob Grue Simonsen, Hans Zantema

Journal:

Information and Computation

Année:

2011

Langue:

english

Fichier:

PDF, 416 KB

english, 2011

18

A rewriting approach to binary decision diagrams

Hans Zantema, Jaco van de Pol

Journal:

The Journal of Logic and Algebraic Programming

Année:

2001

Langue:

english

Fichier:

PDF, 237 KB

english, 2001

19

Conformational Changes in Bovine-Liver Glutamate Dehydrogenase: a Spin-Label Study

Alt ZANTEMA, Hans J. VOGEL, George T. ROBILLARD

Journal:

Année:

1979

Langue:

english

Fichier:

PDF, 1000 KB

english, 1979

20

[IEEE 2010 10th International Conference on Application of Concurrency to System Design - Braga, TBD, Portugal (2010.06.21-2010.06.25)] 2010 10th International Conference on Application of Concurrency to System Design - Order-Independence of Vector-Based Transition Systems

Raffelsieper, Matthias, Mousavi, MohammadReza, Zantema, Hans

Année:

2010

Langue:

english

Fichier:

PDF, 298 KB

english, 2010

21

FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS

GESER, ALFONS, HOFBAUER, DIETER, WALDMANN, JOHANNES, ZANTEMA, HANS

Journal:

International Journal of Foundations of Computer Science

Année:

2005

Langue:

english

Fichier:

PDF, 945 KB

english, 2005

22

SIZES OF ORDERED DECISION TREES

ZANTEMA, HANS, BODLAENDER, HANS L.

Journal:

International Journal of Foundations of Computer Science

Année:

2002

Langue:

english

Fichier:

PDF, 1.26 MB

english, 2002

23

FINDING SMALL EQUIVALENT DECISION TREES IS HARD

ZANTEMA, HANS, BODLAENDER, HANS L.

Journal:

International Journal of Foundations of Computer Science

Année:

2000

Langue:

english

Fichier:

PDF, 1.83 MB

english, 2000

24

TURTLE GRAPHICS OF MORPHIC SEQUENCES

Journal:

Année:

2016

Langue:

english

Fichier:

PDF, 1.52 MB

english, 2016

25

Ordering sequences by permutation transducers

Bosma, Wieb, Zantema, Hans

Journal:

Indagationes Mathematicae

Année:

2017

Langue:

english

Fichier:

PDF, 389 KB

english, 2017

26

Finding small counterexamples for abstract rewriting properties

Journal:

Mathematical Structures in Computer Science

Année:

2018

Langue:

english

Fichier:

PDF, 191 KB

english, 2018

27

Slowly synchronizing automata with fixed alphabet size

Don, Henk, Zantema, Hans, de Bondt, Michiel

Journal:

Information and Computation

Année:

2020

Fichier:

PDF, 1.69 MB

2020

28

Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond1

Tveretina, Olga, Sinz, Carsten, Zantema, Hans

Journal:

Journal on Satisfiability, Boolean Modeling and Computation

Année:

2010

Fichier:

PDF, 549 KB

2010